Tractable Falsifiability
نویسندگان
چکیده
We propose to strengthen Popper’s notion of falsifiability by adding the requirement that when an observation is inconsistent with a theory, there must be a “short proof” of this inconsistency. We model the concept of a short proof using tools from computational complexity, and provide some examples of economic theories that are falsifiable in the usual sense but not with this additional requirement. We consider several variants of the definition of “short proof” and several assumptions about the difficulty of computation, and study their different implications on the falsifiability of theories.
منابع مشابه
Maximal Falsifiability - Definitions, Algorithms, and Applications
Similarly to Maximum Satisfiability (MaxSAT), Minimum Satisfiability (MinSAT) is an optimization extension of the Boolean Satisfiability (SAT) decision problem. In recent years, both problems have been studied in terms of exact and approximation algorithms. In addition, the MaxSAT problem has been characterized in terms of Maximal Satisfiable Subsets (MSSes) and Minimal Correction Subsets (MCSe...
متن کاملThe Determinants of Knowability
Many propositions are not known to be true or false, and many phenomena are not understood. What determines what propositions and phenomena are perceived as knowable or unknowable? We tested whether factors related to scientific methodology (a proposition’s reducibility and falsifiability), its intrinsic metaphysics (the materiality of the phenomena and its scope of applicability), and its rela...
متن کاملEmpiricism and Intelligent Design I: Three Empiricist Challenges
Due to the logical relations between theism and intelligent design (ID), there are two challenges to theism that also apply to ID. In the falsifiability challenge, it is charged that theism is compatible with every observation statement and thus asserts nothing. I argue that the contentious assumptions of this challenge can be avoided without loss of precision by charging theism (and thus ID) d...
متن کاملCarnap on empirical significance
Carnap’s search for a criterion of empirical significance is usually considered a failure. I argue that the results from two out of his three different approaches are at the very least problematic, but that one approach led to success. Carnap’s criterion of translatability into logical syntax is too vague to allow for definite results. His criteria for terms—introducibility by chains of reducti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013